Superimposed codes based on punctured convolutional codesHATTORI, M; SAITOH, Y.Electronics Letters. 1994, Vol 30, Num 13, pp 1041-1042, issn 0013-5194Article

Frog-in-the-box index codes with maximum likelihood decoding for robust scalar quantizationNA, Ilju; NEUHOFF, David L.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 428Conference Paper

Linear codes with complementary dualsMASSEY, J. L.Discrete mathematics. 1992, Vol 106-7, pp 337-342, issn 0012-365XArticle

Maximum-likelihood trellis decoding technique for balanced codesMARKARIAN, G; HONARY, B; BLAUM, M et al.Electronics Letters. 1995, Vol 31, Num 6, pp 447-448, issn 0013-5194Article

User-separating demodulation for code-division multiple-access systemsRUPF, M; TARKÖY, F; MASSEY, J. L et al.IEEE journal on selected areas in communications. 1994, Vol 12, Num 5, pp 786-795, issn 0733-8716Article

New detection algorithm with reduced complexityBENELLI, G; FANTACCI, R.IEE Proceedings. I. Communications, speech and vision. 1990, Vol 137, Num 1, pp 47-59, 13 p., 1Article

Suboptimum decoding of decomposable block codesTAKATA, Y; YAMASHITA, Y; FUJIWARA, T et al.IEEE transactions on information theory. 1994, Vol 40, Num 5, pp 1392-1405, issn 0018-9448Article

Maximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problemHSU, Chun-Hao; ANASTASOPOULOS, Achilleas.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 147Conference Paper

Decoding spherical codes for the Gaussian channelKARLOF, J. K.IEEE transactions on information theory. 1993, Vol 39, Num 1, pp 60-65, issn 0018-9448Article

A TIGHTENED UPPER BOUND ON THE ERROR PROBABILITY OF BINARY CONVOLUTIONAL CODES WITH VITERBI DECODING.VAN DE MEEBERG L.1974; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1974; VOL. 20; NO 3; PP. 389-391; BIBL. 1 REF.Article

CODING1972; IN: CONF. CANAD. COMMUN. ET T.H.T.; MONTREAL; 1972; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1972; PP. 42-49; BIBL. DISSEM.Conference Paper

CONVOLUTIONAL CODES. II. MAXIMUM-LIKELIHOOD DECODING.FORNEY GD JR.1974; INFORM. AND CONTROL.; U.S.A.; DA. 1974; VOL. 25; NO 3; PP. 222-266; BIBL. 1 P. 1/2Article

Expanding Window Fountain Codes for Unequal Error ProtectionSEJDINOVIC, Dino; VUKOBRATOVIC, Dejan; DOUFEXI, Angela et al.IEEE transactions on communications. 2009, Vol 57, Num 9, pp 2510-2516, issn 0090-6778, 7 p.Article

Gallager first bounding technique for the performance evaluation of maximum-likelihood decoded linear binary block codesYOUSEFI, S.IEE proceedings. Communications. 2006, Vol 153, Num 3, pp 317-332, issn 1350-2425, 16 p.Article

Belief-propagation with information correction : Improved near maximum-likelihood decoding of low-density parity-check codesVARNICA, Nedeljko; FOSSORIER, Marc.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 343Conference Paper

On the search for high-rate quasi-orthogonal space-time block codeYUEN, Chau; YONG LIANG GUAN; TJENG THIANG TJHUNG et al.IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications. 2004, pp 1647-1651, isbn 0-7803-8523-3, 4Vol, 5 p.Conference Paper

A reduced-state sequence estimation technique and its applicationsRUNSHENG HE; CRUZ, J. R; HONGXIN SONG et al.IEEE transactions on magnetics. 1999, Vol 35, Num 5, pp 2331-2333, issn 0018-9464, 1Conference Paper

Reduced-tree-based soft decoding for block-coded modulationJADHAV, A; SIDDIQI, M.IEE proceedings. Communications. 1997, Vol 144, Num 2, pp 79-83, issn 1350-2425Article

Maximum-likelihood decoding of array codes with trellis structureHONARY, B; KAYA, L; MARKARIAN, G. S et al.IEE proceedings. I. Communications, speech and vision. 1993, Vol 140, Num 5, pp 340-345, issn 0956-3776Article

Affine Reflection Group CodesNIYOMSATAYA, Terasan; MIRI, Ali; NEVINS, Monica et al.IEEE transactions on information theory. 2008, Vol 54, Num 1, pp 441-454, issn 0018-9448, 14 p.Article

Turbo Codes in Binary Erasure ChannelLEE, Jeong W; URBANKE, Riidiger L; BLAHUT, Richard E et al.IEEE transactions on information theory. 2008, Vol 54, Num 4, pp 1765-1773, issn 0018-9448, 9 p.Article

On the complexity of exact maximum likelihood decoding on tail-biting trellisesSHANKAR, Priti.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 104Conference Paper

Improved fast correlation attack using low rate codesMOLLAND, Havard; MATHIASSEN, John Erik; HELLESETH, Tor et al.Lecture notes in computer science. 2003, pp 67-81, issn 0302-9743, isbn 3-540-20663-9, 15 p.Conference Paper

Adaptive soft-decision decoding for array codesPENG, Xiao-Hong; FARRELL, Paddy G.European transactions on telecommunications. 2001, Vol 12, Num 6, pp 487-499, issn 1124-318XArticle

Sufficient conditions on most likely local sub-codewords in recursive maximum likelihood decoding algorithmsKASAMI, Tadao; TOKUSHIGE, Hitoshi; KAJI, Yuichi et al.Lecture notes in computer science. 2001, pp 333-342, issn 0302-9743, isbn 3-540-42911-5Conference Paper